An extension of Buchberger’s criteria for Gröbner basis decision

نویسنده

  • John Perry
چکیده

Two fundamental questions in the theory of Gröbner bases are decision (‘Is a basis G of a polynomial ideal a Gröbner basis?’) and transformation (‘If it is not, how do we transform it into a Gröbner basis?’) This paper considers the first question. It is well known that G is a Gröbner basis if and only if a certain set of polynomials (the S-polynomials) satisfy a certain property. In general there are m(m− 1)/2 of these, where m is the number of polynomials in G, but criteria due to Buchberger and others often allow one to consider a smaller number. This paper presents two original results. The first is a new characterization theorem for Gröbner bases that makes use of a new criterion that extends Buchberger’s criteria. The second is the identification of a class of polynomial systems G for which the new criterion has dramatic impact, reducing the worst-case scenario from m(m− 1)/2 S-polynomials to m− 1.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gröbner Bases, H–bases and Interpolation

The paper is concerned with a construction for H–bases of polynomial ideals without relying on term orders. The main ingredient is a homogeneous reduction algorithm which orthogonalizes leading terms instead of completely canceling them. This allows for an extension of Buchberger’s algorithm to construct these H–bases algorithmically. In addition, the close connection of this approach to minima...

متن کامل

Superfluous S-polynomials in Strategy-Independent Gröbner Bases

Using the machinery of proof orders originally introduced by Bachmair and Dershowitz in the context of canonical equational proofs, we give an abstract, strategy-independent presentation of Gröbner basis procedures and prove the correctness of two classical criteria for recognising superfluous S-polynomials, Buchberger’s criteria 1 and 2, w.r.t. arbitrary fair and correct basis construction str...

متن کامل

Are Buchberger's criteria necessary for the chain condition?

Buchberger’s Gröbner basis theory plays a fundamental role in symbolic computation. The resulting algorithms essentially carry out several S-polynomial reductions. In his PhD thesis and later publication Buchberger showed that sometimes one can skip S-polynomial reductions if the leading terms of polynomials satisfy certain criteria. A question naturally arises: Are Buchberger’s criteria also n...

متن کامل

Involutive Algorithms for Computing Gröbner Bases

In this paper we describe an efficient involutive algorithm for constructing Gröbner bases of polynomial ideals. The algorithm is based on the concept of involutive monomial division which restricts the conventional division in a certain way. In the presented algorithm a reduced Gröbner basis is the internally fixed subset of an involutive basis, and having computed the later, the former can be...

متن کامل

Construction of Gröbner Bases: Avoiding S-Polynomials – Buchberger’s First Criterium

We continue the formalization of Groebner bases following the book “Groebner Bases – A Computational Approach to Commutative Algebra” by Becker and Weispfenning. Here we prove Buchberger’s first criterium on avoiding S-polynomials: S-polynomials for polynomials with disjoint head terms need not be considered when constructing Groebner bases. In the course of formalizing this theorem we also int...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009